Test Series - Data Structure

3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117

Test Number 93/115

Q: What is the other name for Suffix Tree?
A. Array
B. Stack
C. Priority Queue
D. PAT Tree
Solution: In computer science, a suffix tree is also known as PAT tree or position tree. It is a compressed search tree or prefix tree in which keys contain the suffix of text values as the text position.
Q: Which tree allows fast implementation of string operation?
A. Rope Tree
B. Suffix Tree
C. Tango Tree
D. Top Tree
Solution: In computer science, a suffix tree is also known as PAT tree or position tree. It is a compressed search tree or prefix tree in which keys contain the suffix of text values as the text position. It allows fast string operation to be carried out by the user.
Q: How much time does construction of suffix tree take?
A. O (log M)
B. O (M!)
C. Exponential to Length of Tree
D. Linear to Length of Tree
Solution: Suffix tree is also known as PAT tree or position tree. It is a compressed search tree or prefix tree in which keys contain the suffix of text values as the text position. It allows fast string operation. Total time taken for construction of suffix tree is linear to the length of the tree.
Q: How much space does construction of suffix tree takes?
A. O (log M)
B. Exponential to Length of Tree
C. O (M!)
D. Linear to Length of Tree
Solution: Suffix tree is also known as PAT tree or position tree. It is a compressed search tree or prefix tree in which keys contain the suffix of text values as the text position. It allows fast string operation. Total space taken for construction of a suffix tree is linear to the length of the tree.
Q: Which tree provides a linear time solution for substring operation?
A. Rope Tree
B. Suffix Tree
C. Tango Tree
D. Top Tree
Solution: It is a compressed search tree or prefix tree in which keys contain the suffix of text values as the text position. It allows fast string operation to be carried out by the user. The substring operation can be performed by suffix tree in linear time.
Q: Who proposed the concept of Suffix Tree?
A. Weiner
B. Samuel F. B. Morse
C. Friedrich Clemens Gerke
D. Alexander Morse
Solution: In computer science, a suffix tree is also known as PAT tree or position tree. It is a compressed search tree or prefix tree in which keys contain the suffix of text values as the text position. The concept of Suffix Tree was introduced by Weiner in 1973.
Q: Who among the following provided the first online contribution of Suffix Tree?
A. Weiner
B. Samuel F. B. Morse
C. Ukkonen
D. Alexander Morse
Solution: In computer science, a suffix tree is also known as PAT tree or position tree. The concept of Suffix Tree was introduced by Weiner in 1973. Ukkonen provided the first online contribution of Suffix tree which had the time complexity of the fastest algorithm of that period.
Q: What is the time complexity of Uttkonen’s algorithm?
A. O (log n!)
B. O (n!)
C. O (n2)
D. O (n log n)
Solution: The concept of Suffix Tree was introduced by Weiner in 1973. Ukkonen provided the first online contribution of Suffix tree which had the time complexity of the fastest algorithm of that period. Ukkonen’s algorithm had a time complexity of n log n.
Q: Who among the following provided the first suffix tree contribution for all alphabet?
A. Weiner
B. Farach
C. Ukkonen
D. Alexander Morse
Solution: The concept of Suffix Tree was introduced by Weiner in 1973. Ukkonen provided the first online contribution of Suffix tree which had the time complexity of the fastest algorithm of that period. Farach gave the first suffix tree contribution for all alphabets in 1997.
Q: Who among the following algorithm is used in external memory and compression of the suffix tree?
A. Weiner’s algorithm
B. Farach’s algorithm
C. Ukkonen’s algorithm
D. Alexander Morse
Solution: The concept of Suffix Tree was introduced by Weiner in 1973. Ukkonen provided the first online contribution of the Suffix tree. Farach gave the first suffix tree contribution for all alphabets in 1997. Farach’s algorithm is used in external memory and compression.

You Have Score    /10